Is spacetime absolutely or just most probably Lorentzian?

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Why is spacetime Lorentzian?

We expand on the idea that spacetime signature should be treated as a dy-namical degree of freedom in quantum field theory. It has been argued that the probability distribution for signature, induced by massless free fields, is peaked at the Lorentzian value uniquely in D=4 dimensions. This argument is reviewed, and certain consistency constraints on the generalized signature (i.e. the tangent ...

متن کامل

Embedding graphs in Lorentzian spacetime

Geometric approaches to network analysis combine simply defined models with great descriptive power. In this work we provide a method for embedding directed acyclic graphs (DAG) into Minkowski spacetime using Multidimensional scaling (MDS). First we generalise the classical MDS algorithm, defined only for metrics with a Riemannian signature, to manifolds of any metric signature. We then use thi...

متن کامل

Most Probably Intersecting Hypergraphs

The celebrated Erdős-Ko-Rado theorem shows that for n > 2k the largest intersecting k-uniform set family on [n] has size ( n−1 k−1 ) . It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona introduced the notion of most probably intersecting families, which maximise the probability of random subfamilies being intersecting. We consider the most prob...

متن کامل

Is Just War Theory Obsolete?

Just War Theory can be found in almost all major cultures. But since war was a business that could not be easily stopped, some aimed to constrain it. In its classic form, Just War Theory has been around for several centuries—ever since nationhood in Europe replaced provincial governments. Having made some introductory considerations, I will ask: should Just War Theory be left as it is, changed,...

متن کامل

Most Probably Intersecting Families of Subsets

Let F be a family of an n-element set. It is called intersecting if every pair of its members have a non-disjoint intersection. It is wellknown that an intersecting family satisfies the inequality |F| ≤ 2n−1. Suppose that |F| = 2n−1+i. Choose the members of F independently with probability p (delete them with probability 1−p). The new family is intersecting with a certain probability. We try to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Classical and Quantum Gravity

سال: 2016

ISSN: 0264-9381,1361-6382

DOI: 10.1088/0264-9381/33/16/165009